Digital Library


Search: "[ keyword: Format′s theorem ]" (1)
    A Fast Method for Computing Multiplcative Inverses in GF(2$^{m}$ ) Using Normal Bases
    , , Vol. 13, No. 2, pp. 127-132, Apr. 2003
    10.13089/JKIISC.2003.13.2.127
    Keywords: Crptography, Finite field GF(2$^{m}$ ), Multiplicative inversion, Format′s theorem, Normal bases